Approximation Algorithms for Computing Maximin Share Allocations
نویسندگان
چکیده
منابع مشابه
On Truthful Mechanisms for Maximin Share Allocations
We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of n players, the maximin share of a single player is the best she can guarantee to herself, if she would partition the items in any way she prefers, into n bundles, and then receive her least desirable bundle. The objective then is to find an allocation, so that each player...
متن کاملApproximate Maximin Share Allocations in Matroids
The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorith...
متن کاملApproximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods
We consider Max-min Share (MmS) allocations of items both in the case where items are goods (positive utility) and when they are chores (negative utility). We show that fair allocations of goods and chores have some fundamental connections but differences as well. We prove that like in the case for goods, an MmS allocation does not need to exist for chores and computing an MmS allocation if it ...
متن کاملImproved Approximation Algorithms for Budgeted Allocations
We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e−1) approximation of Andelman and Mansour [1] and the e/(e − 1) − approximation (for ≈ 0.0001) of Feige and Vondrak [2] for the more general Maximum Submodular Welfare (SMW) problem. For a special case of our problem, we improve th...
متن کاملExplicit Collusion and Market Share Allocations
We show that explicit cartels can implement market share allocations using a reporting framework that is considered to be legally acceptable for trade associations. This simple resolution of the market share cartels monitoring problem provides an explanation for the apparent prevalence of market share allocations relative to customer or geographic allocations by explicit cartels. Keywords: exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2017
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3147173